منابع مشابه
A Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملStochastic Vehicle Routing with Random Travel Times
We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can b...
متن کاملCombinatorics of Partial Derivatives
The natural forms of the Leibniz rule for the kth derivative of a product and of Faà di Bruno’s formula for the kth derivative of a composition involve the differential operator ∂/∂x1 · · · ∂xk rather than dk/dxk, with no assumptions about whether the variables x1, . . . , xk are all distinct, or all identical, or partitioned into several distinguishable classes of indistinguishable variables. ...
متن کاملNetwork Search Games with Asymmetric Travel Times
A point H is hidden in a rooted tree Q which is endowed with asymmetric distances (travel times) between nodes. We determine the randomized search strategy, starting from the root, which minimizes the expected time to reach H; in the worst case. This is equivalent to a zero-sum search game (Q), with minimizing Searcher, maximizing Hider and payo¤ equal to the capture time. The worst Hiding dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geophysical Journal International
سال: 1974
ISSN: 0956-540X,1365-246X
DOI: 10.1111/j.1365-246x.1974.tb03635.x